A pointer logic and certifying compiler
نویسندگان
چکیده
منابع مشابه
Towards Compiler-Independent Certifying Compilation
Certifying compilation allows a compiler to produce annotations which prove that target code abides by a speciied safety policy. An independent veriier can check the code without needing to trust the compiler. For such a system to be generally useful, the safety policy should be expressive enough to allow diierent compilers to eeectively produce certiiable code. In this work, we use our experie...
متن کاملThe Design and Implementation of a Certifying Compiler
Optimizing compilers continue to be critical tools in all software development processes. Even more than in 1998 when this paper first appeared, production-quality compilers have become so complex that they defy any attempt at formal verification. Compilers are debugged using large numbers of test cases, some of which are distilled at considerable expense from large application programs. Beside...
متن کاملA Context-Sensitive Pointer Analysis Phase in Open64 Compiler
The precision of the pointer analysis plays an important role in compiler and other software understanding tools. Contextsensitivity is proven to be an effective methods to improve the precision of the final results of pointer analysis. Many context-sensitive pointer analysis methods have been proposed, however, few of them have been incorporated into production compilers. In Open64 compiler, i...
متن کاملA Pointer Logic for Object Diagrams
Compositional reasoning about pointers and references is crucial to verification of contemporary software. This paper introduces a pointer logic that extends Separation Logic with a fixpoint operator and new compositions different from separating conjunction. Higher level of abstraction can be achieved if the right compositions are used in the right places. In particular, if a relation is a ‘fu...
متن کاملTWAM: A Certifying Abstract Machine for Logic Programs
Type-preserving (or typed) compilation uses typing derivations to certify correctness properties of compilation. We have designed and implemented a type-preserving compiler for a simply-typed dialect of Prolog we call T-Prolog. The crux of our approach is a new certifying abstract machine which we call the TypedWarren Abstract Machine (TWAM). The TWAMhas a dependent type system strong enough to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers of Computer Science in China
سال: 2007
ISSN: 1673-7350,1673-7466
DOI: 10.1007/s11704-007-0029-9